Graph Coloring Compactness Theorems Equivalent to BPI
نویسندگان
چکیده
We introduce compactness theorems for generalized colorings and derive several particular compactness theorems from them. It is proved that the theorems and many of their consequences are equivalent in ZF set theory to BPI, the Prime Ideal Theorem for Boolean algebras. keywords: generalized graph colorings, compactness, prime ideal theorem MSC: 05C15; 03E25 .
منابع مشابه
Restricted versions of the Tukey-Teichmüller theorem that are equivalent to the Boolean prime ideal theorem
We formulate a restricted version of the Tukey-Teichmüller Theorem that we denote by (rTT). We then prove that (rTT) and (BPI) are equivalent in ZF and that (rTT) applies rather naturally to several equivalent forms of (BPI): Alexander Subbase Theorem, Stone Representation Theorem, Model Existence and Compactness Theorems for propositional and first-order logic. We also give two variations of (...
متن کاملA coloring property for countable groups
Motivated by research on hyperfinite equivalence relations we define a coloring property for countable groups. We prove that every countable group has the coloring property. This implies a compactness theorem for closed complete sections of the free part of the shift action of G on 2G . Our theorems generalize known results about Z.
متن کاملA Compactness Theorem for In nite
A useful compactness theorem for constraint satisfaction problems is proved equivalent to BPI, the Boolean Prime Ideal Theorem. The relation of various restricted versions of the Theorem to each other and to BPI is also explored.
متن کاملSome Connections Between Set Theory and Computer Science
Methods originating in theoreticar computer science for shoiving that certain decision probrems are Np-complete have also been used to show that certain compactness theorems are equivalent in ZF set theory to the Boolean Prime ldear rheorem (BpI). conversely, there is some evidence that set theoretic methods connnected with research on BPI may prove useful in computer science. we survey what is...
متن کاملKempe Equivalence of Colorings
Several basic theorems about the chromatic number of graphs can be extended to results in which, in addition to the existence of a kcoloring, it is also shown that all k-colorings of the graph in question are Kempe equivalent. Here, it is also proved that for a planar graph with chromatic number less than k, all k-colorings are Kempe equivalent.
متن کامل